Super Connected Direct Product of Graphs and Cycles

The topology of an interconnection network can be modeled by a graph G=(V(G),E(G)). connectivity G is parameter used to measure the reliability corresponding network. direct product important product. This paper mainly focuses on super connectedness graphs and cycles. G, denoted κ(G), size minimum vertex set S⊆V(G) such that G−S not connected or has only one vertex. said connected, simply super-κ, if every cut neighborhood with degree. two H, G×H, V(G×H)=V(G)×V(H) edge E(G×H)={(u1,v1)(u2,v2)|u1u2∈E(G),v1v2∈E(H)}. In this paper, we give some sufficient conditions for G×Cn where Cn cycle n vertices. Furthermore, those are best possible.